Performance bounds for estimating vector systems

نویسندگان

  • Arye Nehorai
  • Malcolm Hawkes
چکیده

We propose a unified framework for the analysis of estimators of geometrical vector quantities and vector systems through a collection of performance measures. Unlike standard performance indicators, these measures have intuitive geometrical and physical interpretations, are independent of the coordinate reference frame, and are applicable to arbitrary parameterizations of the unknown vector or system of vectors. For each measure, we derive both finite-sample and asymptotic lower bounds that hold for large classes of estimators and serve as benchmarks for the assessment of estimation algorithms. Like the performance measures themselves, these bounds are independent of the reference coordinate frame, and we discuss their use as system design criteria.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Estimating ‎U‎pper and Lower Bounds For Industry Efficiency With Unknown ‎Technology‎

With a brief review of the studies on the industry in Data Envelopment Analysis (DEA) framework, the present paper proposes inner and outer technologies when only some basic information is available about the technology. Furthermore, applying Linear Programming techniques, it also determines lower and upper bounds for directional distance function (DDF) measure, overall and allocative efficienc...

متن کامل

Sparse Bayesian Learning for Joint Channel Estimation and Data Detection in OFDM Systems

Bayesian approaches for sparse signal recovery have enjoyed a long-standing history in signal processing and machine learning literature. Among the Bayesian techniques, the expectation maximization based Sparse Bayesian Learning (SBL) approach is an iterative procedure with global convergence guarantee to a local optimum, which uses a parameterized prior that encourages sparsity under an eviden...

متن کامل

Cramer Rao-Type Bounds for Sparse Bayesian Learning

In this paper, we derive Hybrid, Bayesian and Marginalized Cramér-Rao lower bounds (HCRB, BCRB and MCRB) for the single and multiple measurement vector Sparse Bayesian Learning (SBL) problem of estimating compressible vectors and their prior distribution parameters. We assume the unknown vector to be drawn from a compressible Student-t prior distribution. We derive CRBs that encompass the deter...

متن کامل

A stochastic version analysis of an M/G/1 retrial queue with Bernoulli‎ ‎schedule‎

‎In this work‎, ‎we derive insensitive bounds for various performance measures of a single-server‎ ‎retrial queue with generally distributed inter-retrial times and Bernoulli schedule‎, ‎under the special‎ ‎assumption that only the customer at the head of the orbit queue (i.e.‎, ‎a‎ ‎FCFS discipline governing the flow from the orbit to the server) is allowed‎ ‎to occupy the server‎. ‎The method...

متن کامل

Fault diagnosis in a distillation column using a support vector machine based classifier

Fault diagnosis has always been an essential aspect of control system design. This is necessary due to the growing demand for increased performance and safety of industrial systems is discussed. Support vector machine classifier is a new technique based on statistical learning theory and is designed to reduce structural bias. Support vector machine classification in many applications in v...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • IEEE Trans. Signal Processing

دوره 48  شماره 

صفحات  -

تاریخ انتشار 2000